Measuring The Cost Of A Cache Miss

نویسندگان

  • Thomas R. Puzak
  • Allan Hartstein
  • Philip E. Emma
  • Viji Srinivasan
چکیده

It is vital that the cost of a cache miss be accurately measured in order for many hardware and software optimizations to occur. In this paper we describe a new technique, called pipeline spectroscopy, that allows pipeline delays to be monitored and analyzed in detail. We apply this technique to produce a cache miss ‘spectrogram’, which represents a precise readout showing a detailed histogram (visualization) of the cost of each cache miss. Cache miss spectrograms are produced by comparing instruction sequences and execution times that occurred near a miss in a 'finite cache' simulation run to the same set of instructions and execution times in an 'infinite cache' run. Cache misses are divided into clusters, and the miss penalty associated with each cluster is determined by identifying an upper and lower bound instruction around each miss cluster and calculating the cycle difference between these bounds. Detailed analysis of a spectrogram leads to much greater insight in pipeline dynamics, including effects due to miss cluster, miss overlap, prefetching, and miss queueing delays.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analyzing the Cost of a Cache Miss Using Pipeline Spectroscopy

We describe a new technique called Pipeline Spectroscopy that allows us to precisely measure the cost of each cache miss. The cost of a miss is displayed (graphed) as a histogram, which represents a precise readout showing a detailed visualization of the cost of each cache miss throughout all levels of the memory hierarchy. We call the graphs ‘spectrograms’ because they reveal certain signature...

متن کامل

Enhanced Flush+Reload Attack on AES

In cloud computing, multiple users can share the same physical machine that can potentially leak secret information, in particular when the memory de-duplication is enabled. Flush+Reload attack is a cache-based attack that makes use of resource sharing. T-table implementation of AES is commonly used in the crypto libraries like OpenSSL. Several Flush+Reload attacks on T-table implementat...

متن کامل

Cost-Sensitive Cache Replacement Algorithms

Cache replacement algorithms originally developed in the context of simple uniprocessor systems are aimed at reducing the aggregate miss count. However, in modern systems, cache misses have different costs. The cost may be latency, penalty, power consumption, bandwidth consumption, or any other ad-hoc property attached to a miss. Thus, in many practical cases, it is desirable to inject the cost...

متن کامل

Cache Memory: An Analysis on Optimization Techniques

Processor speed is increasing at a very fast rate comparing to the access latency of the main memory. The effect of this gap can be reduced by using cache memory in an efficient manner. This paper will discuss how to improve the performance of cache based on miss rate, hit rates, latency, efficiency, and cost. Keywords—Cache optimization; cache miss; latency; memory

متن کامل

Can High Bandwidth and Latency Justify Large Cache Blocks

An important architectural design decision aaecting the performance of coherent caches in shared-memory multiprocessors is the choice of block size. There are two primary factors that innuence this choice: the reference behavior of application programs and the remote access band-width and latency of the machine. Several studies have shown that increasing the block size can lower the miss rate a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006